First-Passage Percolation with Exponential Times on a Ladder
نویسنده
چکیده
We consider first-passage percolation on a ladder, i.e. the graph N × {0, 1} where nodes at distance 1 are joined by an edge, and the times are exponentially i.i.d. with mean 1. We find an appropriate Markov chain to calculate an explicit expression for the time constant whose numerical value is ≈ 0.6827. This time constant is the long-term average inverse speed of the process.
منابع مشابه
On the Markov Transition Kernels for First Passage Percolation on the Ladder
We consider the first passage percolation problem on the random graph with vertex set N×{0, 1}, edges joining vertices at a Euclidean distance equal to unity, and independent exponential edgeweights. We provide a central limit theorem for the first passage times ln between the vertices (0, 0) and (n, 0), thus extending earlier results about the almost-sure convergence of ln/n as n → ∞. We use g...
متن کاملConstruction of a Short Path in High-dimensional First Passage Percolation
For first passage percolation in Zd with large d, we construct a path connecting the origin to {x1 = 1}, whose passage time has optimal order log d/d. Besides, an improved lower bound for the "diagonal" speed of the cluster combined with a result by Dhar (1988) shows that the limiting shape in FPP with exponential passage times (and thus that of Eden model) is not the euclidian ball in dimensio...
متن کاملPERCOLATION, FIRST-PASSAGE PERCOLATION, AND COVERING TIMES FOR RICHARDSON’S MODEL ON THE n-CUBE
Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube Bn = {0, 1} with nearest neighbor edges. For oriented and unoriented percolation, p = e/n and p = 1/n are the respective critical probabilities. For oriented first-passage percolation with i.i.d. edge-passage times having a density of 1 near the origin, the percolation time (time to reach the op...
متن کاملPERCOLATION, FIRST-PASSAGE PERCOLATION, AND COVERING TIMES FOR RICHARDSON’S MODEL ON THE n-CUBE
Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube Bn = {0, 1}n with nearest neighbor edges. For oriented and unoriented percolation, p = e/n and p = 1/n are the respective critical probabilities. For oriented first-passage percolation with i.i.d. edge-passage times having a density of 1 near the origin, the percolation time (time to reach the o...
متن کاملCoexistence in Two-type First-passage Percolation Models by Olivier Garet
We study the problem of coexistence in a two-type competition model governed by first-passage percolation on Zd or on the infinite cluster in Bernoulli percolation. We prove for a large class of ergodic stationary passage times that for distinct points x, y ∈ Zd , there is a strictly positive probability that {z ∈ Zd ;d(y, z) < d(x, z)} and {z ∈ Zd ;d(y, z) > d(x, z)} are both infinite sets. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 19 شماره
صفحات -
تاریخ انتشار 2010